Tokunaga and Horton self-similarity for level set trees of Markov chains

نویسندگان

  • Ilia Zaliapin
  • Yevgeniy Kovchegov
چکیده

The Horton and Tokunaga branching laws provide a convenient framework for studying self-similarity in random trees. The Horton self-similarity is a weaker property that addresses the principal branching in a tree; it is a counterpart of the power-law size distribution for elements of a branching system. The stronger Tokunaga self-similarity addresses so-called side branching. The Horton and Tokunaga self-similarity have been empirically established in numerous observed and modeled systems, and proven for two paradigmatic models: the critical Galton–Watson branching process with finite progeny and the finitetree representation of a regular Brownian excursion. This study establishes the Tokunaga and Horton self-similarity for a tree representation of a finite symmetric homogeneous Markov chain. We also extend the concept of Horton and Tokunaga self-similarity to infinite trees and establish self-similarity for an infinite-tree representation of a regular Brownian motion. We conjecture that fractional Brownian motions are also Tokunaga and Horton self-similar, with self-similarity parameters depending on the Hurst exponent. 2011 Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Horton Law in Self-Similar Trees

Abstract. Self-similarity of random trees is related to the operation of pruning. Pruning R cuts the leaves and their parental edges and removes the resulting chains of degree-two nodes from a finite tree. A Horton-Strahler order of a vertex v and its parental edge is defined as the minimal number of prunings necessary to eliminate the subtree rooted at v. A branch is a group of neighboring ver...

متن کامل

Empirical Bayes Estimation in Nonstationary Markov chains

Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical  Bayes estimators  for the transition probability  matrix of a finite nonstationary  Markov chain. The data are assumed to be of  a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...

متن کامل

Fractal Trees with Side Branching

This paper considers fractal trees with self-similar side branching. The Tokunaga classification system for side branching is introduced, along with the Tokunaga self-similarity condition. Area filling (D = 2) and volume filling (D = 3) deterministic fractal tree constructions are introduced both with and without side branching. Applications to diffusion limited aggregation (DLA), actual draina...

متن کامل

Self-similar scaling limits of non-increasing Markov chains

We study scaling limits of non-increasing Markov chains with values in the set of non-negative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We show that the chain starting from n and appropriately rescaled, converges in distribution, as n → ∞, to a non-increasing self-similar Markov process. This c...

متن کامل

Horton Self-similarity of Kingman’s Coalescent Tree

The paper establishes Horton self-similarity for a tree representation of Kingman’s coalescent process. The proof is based on a Smoluchowski-type system of ordinary differential equations that describes evolution of the number of branches of a given HortonStrahler order in a tree that represents Kingman’s N -coalescent, in a hydrodynamic limit. We also demonstrate a close connection between the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011